Dlp

DLP (for Description Logic Prover) is a description logic system that contains a sound and complete rea-soner for an expressive description logic. DLP is an experimental system, in that it does not contain all the support facilities that one might like in a full description logic system. However, DLP does have an interface that allows the creation and examination of taxonomies of concepts. DLP employs a heavily-optimised decision procedure for description logic satissability to determine subsumption relationships. This decision procedure has excellent performance on a wide variety of test suites, including several propositional modal logic test suites. Language DLP implements the description logic shown in Figure 1. In the syntax chart A is a concept name; C and D are arbitrary concepts; P is a role name; R and S are arbitrary roles. Concept and role names are given meaning via operations that deene them. DLP requires that concepts be deened before they are used in descriptions. The semantics for DLP is a normal semantics for description logics, with a domain I , disjoint from the integers, and an interpretation function I for concepts and roles. DLP's reasoner is sound and complete for this logic, modulo bugs in the implementation. It uses the now-standard method for subsumption testing in description logics, namely translating subsumption tests into sat-issability tests and checking for satissability using an optimised tableaux method. DLP accepts a subset of the KRSS speciication Patel-Schneider and Swartout, 1993]. It implements the following operators: